On realizations of a joint degree matrix
نویسندگان
چکیده
منابع مشابه
On Realizations of a Joint Degree Matrix
The joint degree matrix of a graph gives the number of edges between vertices of degree i and degree j for every pair (i, j). One can perform restricted swap operations to transform a graph into another with the same joint degree matrix. We prove that the space of all realizations of a given joint degree matrix over a fixed vertex set is connected via these restricted swap operations. This was ...
متن کاملGraphic Realizations of Joint-Degree Matrices
In this paper we introduce extensions and modifications of the classical degree sequence graphic realization problem studied by Erdős-Gallai and Havel-Hakimi, as well as of the corresponding connected graphic realization version. We define the joint-degree matrix graphic (resp. connected graphic) realization problem, where in addition to the degree sequence, the exact number of desired edges be...
متن کاملA decomposition based proof for fast mixing of a Markov chain over balanced realizations of a joint degree matrix
A joint degree matrix (JDM) specifies the number of connections between nodes of given degrees in a graph, for all degree pairs and uniquely determines the degree sequence of the graph. We consider the space of all balanced realizations of an arbitrary JDM, realizations in which the links between any two degree groups are placed as uniformly as possible. We prove that a swap Markov Chain Monte ...
متن کاملOn Directed Tree Realizations of Degree Sets
Given a degree set D = {a1 < a2 < . . . < an} of nonnegative integers, the minimum number of vertices in any tree realizing the set D is known[10]. In this paper, we study the number of vertices and multiplicity of distinct degrees as parameters of tree realizations of degree sets. We explore this in the context of both directed and undirected trees and asymmetric directed graphs (graphs which ...
متن کاملOn Fractional Realizations of Graph Degree Sequences
We introduce fractional realizations of a graph degree sequence and a closely associated convex polytope. Simple graph realizations correspond to a subset of the vertices of this polytope; we characterize degree sequences for which each polytope vertex corresponds to a simple graph realization. These include the degree sequences of threshold and pseudo-split graphs, and we characterize their re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2015
ISSN: 0166-218X
DOI: 10.1016/j.dam.2014.10.012